A Threshold-Based Generalized Selection Combining

نویسندگان

  • Ahmed Iyanda Sulyman
  • Maan Kousa
چکیده

The severity of fading on mobile communication channels calls for the combining of multiple diversity sources to achieve acceptable error rate performance. Traditional approaches perform the combining of the different diversity sources using either: the Conventional Selective diversity combining (CSC), Equal-Gain combining (EGC), or MaximalRatio combining (MRC) Schemes. CSC and MRC are the two extremes of compromise between performance quality and complexity. Some researches have proposed a generalized selection combining scheme (GSC) that combines the best M branches out of the L available diversity resources (M ≤ L). In this paper we analyze a generalized selection combining scheme based on a threshold criterion rather than a fixed-size subset of the best channels. In this scheme, only those diversity branches whose energy levels are above a specified threshold are combined. Closed-form analytical solutions for the BER performances of this scheme over Nakagami Fading Channels are derived. We also discuss the merits of this scheme over GSC. Index Terms — Selection Diversity, Maximal ratio, Threshold, Nakagami,

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

Bit Error Rate Performance Analysis of a Threshold-Based Generalized Selection Combining Scheme in Nakagami Fading Channels

The severity of fading on mobile communication channels calls for the combining of multiple diversity sources to achieve acceptable error rate performance. Traditional approaches perform the combining of the different diversity sources using either the conventional selective diversity combining (CSC), equal-gain combining (EGC), or maximal-ratio combining (MRC) schemes. CSC andMRC are the two e...

متن کامل

Minimum selection GSC and adaptive low-power rake combining scheme

In this paper, we investigate a new generalized selection combining (GSC) technique and an adaptive rake combining scheme to save the power consumption of mobile rake receivers for wideband CDMA systems. The new GSC technique called minimum selection GSC (MS-GSC) selects a minimum number of rake fingers, while maintaining the combined SNR larger than a given threshold. The proposed adaptive rak...

متن کامل

Unified analysis of generalized selection diversity with normalized threshold test per branch

Abstract __ The ability to capture significant amount of transmitted signal energy present in the resolvable multipaths using only a modest number of rake fingers (correlators) is an important receiver design consideration for ultra-wideband (UWB) and wideband CDMA communication systems. This, however, is achieved at the expense of rake receiver performance. Motivated by this need, several subo...

متن کامل

Symbol Error Rate of Quadrature Subbranch Hybrid Selection/Maximal-Ratio Combining in Rayleigh Fading Under Employment of Generalized Detector

The symbol-error rate (SER) of a quadrature subbranch hybrid selection/maximal-ratio combining scheme for 1-D modulations in Rayleigh fading under employment of the generalized receiver, which is constructed based on the generalized approach to signal processing in noise, is investigated. At the generalized receiver, N diversity branches are split into 2N in-phase and quadrature subbranches. Tr...

متن کامل

An Efficient Threshold Verifiable Multi-Secret Sharing Scheme Using Generalized Jacobian of Elliptic Curves

‎In a (t,n)-threshold secret sharing scheme‎, ‎a secret s is distributed among n participants such that any group of t or more participants can reconstruct the secret together‎, ‎but no group of fewer than t participants can do‎. In this paper, we propose a verifiable (t,n)-threshold multi-secret sharing scheme based on Shao and Cao‎, ‎and the intractability of the elliptic curve discrete logar...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

عنوان ژورنال:

دوره   شماره 

صفحات  -

تاریخ انتشار 2005